initial points造句
例句與造句
- an ulcer located at the initial point of entry of a pathogen
初瘡病原體最初侵入的那點處的潰瘍 - in line 109, the polyline element is started, and an initial point is drawn at the origin of the axis
因此，兩個值以20像素的間距繪制，全部數(shù)組的計算結果為： - the results can tend toward infinity at different rates or toward zero, even though the initial points are very close together
結果以不同速率趨向無限大或趨向零，即使初試點是非常接近。 - by genetic algorithm method, the problem can be resolved . for a general optimal approach, the results depend on the initial point
本文隨機確定初始搜索范圍，并結合遺傳算法的隨機搜索特點來構造好的初始值。 - chapter three clarifies a few confusing concepts and points out the logically initial point for the research of the accounting standards setting
第三章明確了會計準則制定研究的邏輯起點和容易混淆的幾個相關概念。 - It's difficult to find initial points in a sentence. 用initial points造句挺難的
- (2 ) suitable optimal economical dispatch model are selected . computered it depend on initial point . then each component of spot price are shown
求出在此優(yōu)化點的各個負荷節(jié)點的網(wǎng)損微增率的值及各節(jié)點的網(wǎng)絡約束值。 - this thesis considers the systems of nonlinear inequalities . and several new algorithms which the initial points are arbitrary are presented
本學位論文討論非線性不等式組，建立了初始點任意的幾個新的非線性不等式組算法。 - iterative tfidf algorithm belongs to hill-climbing algorithm, it has the common problem of converging to local optimal value and sensitive to initial point
迭代tfidf算法屬于爬山算法，初始值的選取對精度影響較大，算法容易收斂到局部最優(yōu)值。 - without the strict feasibility of the initial points and iteration points, the algorithm is shown to possess both polynomial-time complexity and q-linear convergence
該算法不要求初始點及迭代點的可行性且具有q-線性收斂速度和多項式時間復雜性。 - the advantage of genetic algorithms lies in : to search the best solution for many initial points; and find the total optimum solution by means of crossover and mutation operator
它從多個初始點開始尋優(yōu)，借助交叉和變異算子來獲得參數(shù)的全局最優(yōu)解。 - in order to overcome the deficiency that initial points should be strictly feasible in interior point methods, a primal-dual infeasible-interior-point algorithm for the second-order cone programming ( socp ) is presented
摘要為了克服內(nèi)點算法中初始點是嚴格可行的這一缺點，給出二次錐規(guī)劃的一種原對偶不可行內(nèi)點算法。 - in the chapter there, we give a following convergence theorem and error estimation for the traub iterative under new kantorovitch-ostrowski type condition use the information of higher derivatives at initial points
在第三章中，我們在kantorovitch-ostrowski條件下給出了traub迭代法收斂性理論和誤差估計。并建立如下定理：定理2 - it is proved by experiments that the resulting curves in some sense have nice smoothness and inherited some properties of subdivision curves in r ^ 3 space, such as the curves might interpolate or approximate the initial points
實驗證明這類曲線具有較好的光滑度，并繼承了r^3空間中細分曲線的一些特征，如曲線可以是插值或者逼近原始點列。 - the model adopts the relation of the distance from initial point and the elevation, which not only makes the model more applicable in practical engineering but also improves the accuracy of cross-sectional hydraulic characteristics
根據(jù)工程所提供的起點距高程方法進行程序設計，與工程實際結合更為緊密，而且提高了斷面水力特征描述的精確度。
更多例句： 下一頁